x
uploads/prime number.jpg

prime number 【數學】質數,素數。

prime number theorem

The author mainly realized the method of generating the large random numbers and judging the prime number using lehmann means , then three pairs of secure key with different lengths ( 256 bits , 512 bits , 1024 bits ) was generated to meet the demand of different security grade . in encryption module , modular multiplication arithmetic of large number was realized adopting addition chaining . in decryption module , extended euclid was used to get inverse , and the chinese remainder theorem was used to realize decryption , which increased the speed of decryption greatly 作者主要實現了大隨機數的生成、采用整除小素數和勒曼測試法判定素數,可以生成三種不同長度的密鑰對( 256位、 512位、 1024位)來滿足不同的加密安全等級的需求;加密模塊中,選用了二進制序列的乘法方法,實現了大數模冪乘運算;解密模塊中,引用了擴展的歐幾里德法求逆元,并采用中國剩余定理實現解密過程,大大提高了解密速度。

After then , a new method of solving the minimal cuts of s - coherent tree based on bdd and prime number was given in the qualitative analysis of fta based on bdd , the prime implicant sets of non s - coherent tree was calculated by an iterative method 再次,在基于bdd的故障樹定性分析研究中,提出并實現了基于bdd和素數法相結合的單調關聯故障樹最小割集求解的新方法,用迭代法實現了非單調關聯故障樹質蘊含的求解。

Because , at the bit - length of typical keys , very few numbers are primes , public - key systems must use very large keys to prevent exhaustive searches that try to guess the prime numbers used or to factor the keys 就典型鑰匙的位長而言,因為素數的數目是非常少的,故公開密鑰系統必須使用非常大的密鑰,以防止窮盡研究把使用的素數猜出來或把密鑰的因子算出來。

In section 3 , we get an algorithm to look for a primitive root of fp ~ ( 2 ) from a given primitive root of the finite field fp . what ' s more , a table of primitive roots over fp ~ ( 2 ) can be provided for those prime numbers p ( p < 200 ) 第三節中,我們從有限域fp的原根出發得到了一個求fp ~ 2的原根的算法,而且對較小的p ( p 200 )得到fp ~ 2的原根表。

Your pc can help design drugs against aids , model the future climate of the planet , search for new prime numbers or simulate micro - devices for handling satellite propellant , to cite just a few examples 你的個人電腦能有助于設計一些防止艾滋病的藥物、模擬地球未來氣候狀況、找尋新的質數或模仿處理衛星發射燃料的微型裝置? ?這里僅舉幾個例子。

In particular , if the connection integer is a prime number p , then the proportion of 1 ' s in a segment of l - sequence with length t ( 0 < < 1 ) satisfies next the linear complexity of l - sequences is discussed 特別的,若聯接數為素數p ,則l -序列在長為t ( 0 1 )的任意一段中出現1的個數所占的比例(

When the actual load factor reaches the specified load factor , the number of buckets is automatically increased to the smallest prime number that is larger than twice the current number of buckets 當實際加載因子達到指定的加載因子時,存儲桶的數量會自動增加到比當前存儲桶數大兩倍的最小質數。

Much as every integer can be broken down into a product of prime numbers , the symmetries of any object can be constructed from a collection of basic building blocks known as simple groups 正如每個整數都可用一些質數的積表示,任一對象的對稱都可由所謂簡單群的基本構件集合構造出來。

The problem here is to write a program that reports the number of all the pairs of prime numbers satisfying the condition in the conjecture for a given even number 我們的要求是編寫一個程序,對于給定的一個偶數,計算出存在多少對素數滿足這個猜想。

The difficulty of decoding based on cryptograph and public key is equal to the difficult } “ of dividing the product of two big prime numbers 從一個公開密鑰和密文中恢復出明文的難度等價于分解兩個大素數之積。

The private key and public key are the function of a pair of big prime number ( decimal number between 100 and 200 bit or larger ) 其公開密鑰和私人密鑰是一對大素數( 100到200個十進制數或更大)的函數。

The public and private keys are based on a pair of very large prime numbers that are not known by anyone intercepting the message 公開密鑰和秘密密鑰是基于一對想截獲報文的人不知道的非常大的素數。

For example , the pyrex home page prominently features a numeric - intensive function for calculating a list of initial prime numbers 例如, pyrex主頁上使用一個計算素數列表的數學函數來宣揚這個特性。

The following code example creates numbers and identifies each prime number in a sentence , and adds those sentences to the 下面的代碼示例在語句中創建編號并標識每個質數,然后將這些語句添加到

Rsa algorithm is a algorithm for public key instrument . its security based on the difficulty of dividing big prime number Rsa算法是一種公開密鑰算法,它的安全系數取決于大素數分解的難度。

The primesstep1 sample is a pure c project that demonstrates the sieve of eratosthenes to find prime numbers Primesstep1示例是一個純c項目,它說明用于查找質數的埃拉托色尼斯篩法。

Generally , this problem is reduced to quadratic residue problem of modulo a big prime number 一般而言,該問題歸結為模大素數的二次剩余問題,但這種歸結不能用于最優擴域oef 。

It can resist the attack named mov . an algorithm of detecting prime number based on division has been given 同時結合除法篩思想提高了單純miller - rabin素性檢測算法的效率。

It ' s sort of like those probabilistic tests used to produce large prime numbers for public - key cryptography 這類似于那些用來為公開密匙系統產生大質數的概率測試。